Quantum subspace alignment for domain adaptation
نویسندگان
چکیده
منابع مشابه
Subspace Alignment For Domain Adaptation
In this paper, we introduce a new domain adaptation (DA) algorithm where the source and target domains are represented by subspaces spanned by eigenvectors. Our method seeks a domain invariant feature space by learning a mapping function which aligns the source subspace with the target one. We show that the solution of the corresponding optimization problem can be obtained in a simple closed fo...
متن کاملSubspace Distribution Alignment for Unsupervised Domain Adaptation
We propose a novel method for unsupervised domain adaptation. Traditional machine learning algorithms often fail to generalize to new input distributions, causing reduced accuracy. Domain adaptation attempts to compensate for the performance degradation by transferring and adapting source knowledge to target domain. Existing unsupervised methods project domains into a lower-dimensional space an...
متن کاملSubspace Alignment Based Domain Adaptation for RCNN Detector
In this paper, we propose subspace alignment based domain adaptation of the state of the art RCNN based object detector [11]. The aim is to be able to achieve high quality object detection in novel, real world target scenarios without requiring labels from the target domain. While, unsupervised domain adaptation has been studied in the case of object classification, for object detection it has ...
متن کاملGraph and Subspace Learning for Domain Adaptation
Graph and Subspace Learning for Domain Adaptation by Le Shu Doctor of Philosophy in Computer and Information Sciences Temple University in Philadelphia, October, 2015 Researcher Advisor: Longin Jan Latecki In many practical problems, given that the instances in the training and test may be drawn from different distributions, traditional supervised learning can not achieve good performance on th...
متن کاملSampling Methods for Random Subspace Domain Adaptation
Supervised classification tasks like Sentiment Analysis or text classification need labelled training data. These labels can be difficult to obtain, especially for complicated and ambiguous data like texts. Instead of labelling new data, domain adaptation tries to reuse already labelled data from related tasks as training data. We propose a greedy selection strategy to identify a small subset o...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Physical Review A
سال: 2020
ISSN: 2469-9926,2469-9934
DOI: 10.1103/physreva.102.062403